Edge-Odd Gracefulness of C3 Θ PN and C3 Θ 2PN

نویسنده

  • A. Solairaju
چکیده

A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q1} so that induced map f+: V(G) → {0, 1,2, 3, ..., (2k-1)}defined by f+(x)  f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct and odd. In this article, the Edge-odd gracefulness of C3  Pn and C3  2Pn is obtained.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge-Odd Gracefulness of C3 Θ PN and C3 Θ 2PN

A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, ..., (2k-1)}defined by f+(x) o f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct and odd. In this article, the Edge-odd gracefulness of C3  Pn and C3  2Pn is obtained. Refe...

متن کامل

Edge-Odd Gracefulness of C3 Θ PN and C3 Θ 2PN

A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, ..., (2k-1)}defined by f+(x) o f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct and odd. In this article, the Edge-odd gracefulness of C3  Pn and C3  2Pn is obtained. Refe...

متن کامل

Edge-Odd Gracefulness of C3 Θ PN and C3 Θ 2PN

A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, ..., (2k-1)}defined by f+(x) o f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct and odd. In this article, the Edge-odd gracefulness of C3  Pn and C3  2Pn is obtained. Refe...

متن کامل

Edge-Odd Gracefulness of C3 Θ PN and C3 Θ 2PN

A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, ..., (2k-1)}defined by f+(x) o f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct and odd. In this article, the Edge-odd gracefulness of C3  Pn and C3  2Pn is obtained. Refe...

متن کامل

Edge-Odd Gracefulness of C3 Θ PN and C3 Θ 2PN

A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, ..., (2k-1)}defined by f+(x) o f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct and odd. In this article, the Edge-odd gracefulness of C3  Pn and C3  2Pn is obtained. Refe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010